github.com/klauspost/compress/zstd.match.s (field)

27 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L31: 	s      int32
		enc_best.go#L44: 		ofc = ofCode(uint32(m.s-m.offset) + 3)
		enc_best.go#L216: 				left := len(src) - int(m.s+m.length)
		enc_best.go#L221: 				checkLen := m.length - (s - m.s) - 8
		enc_best.go#L251: 			cand := match{offset: offset, s: s, length: l, rep: rep}
		enc_best.go#L253: 			if m.est >= highScore || cand.est-m.est+(cand.s-m.s)*bitsPerByte>>10 < 0 {
		enc_best.go#L258: 		best := match{s: s, est: highScore}
		enc_best.go#L329: 			if best.s > s-skipBeginning {
		enc_best.go#L332: 				if sAt := best.s + best.length; sAt < sLimit {
		enc_best.go#L337: 						improve(&best, off, best.s+skipBeginning, load3232(src, best.s+skipBeginning), -1)
		enc_best.go#L339: 							improve(&best, off, best.s+skipBeginning, load3232(src, best.s+skipBeginning), -1)
		enc_best.go#L347: 			if best.offset >= best.s {
		enc_best.go#L348: 				panic(fmt.Sprintf("best.offset > s: %d >= %d", best.offset, best.s))
		enc_best.go#L350: 			if best.s < nextEmit {
		enc_best.go#L351: 				panic(fmt.Sprintf("s %d < nextEmit %d", best.s, nextEmit))
		enc_best.go#L356: 			if !bytes.Equal(src[best.s:best.s+best.length], src[best.offset:best.offset+best.length]) {
		enc_best.go#L357: 				panic(fmt.Sprintf("match mismatch: %v != %v", src[best.s:best.s+best.length], src[best.offset:best.offset+best.length]))
		enc_best.go#L362: 		s = best.s
		enc_best.go#L366: 			addLiterals(&seq, best.s)
		enc_best.go#L371: 				println("repeat sequence", seq, "next s:", best.s, "off:", best.s-best.offset)
		enc_best.go#L376: 			s = best.s + best.length